________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:38:06
Input Data from:  dataset136.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,168
Average f[i]   :4100
Average g[i,j] :1909,52380952381
Total demand   :16620
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 8
> Selected Move:	3180	1	-1	6	6000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0    >new incumb.: 3180


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 31
> Selected Move:	4680	1	-1	3	10500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0    >new incumb.: 4680


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 37
> Selected Move:	6150	1	-1	7	16500


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  0    >new incumb.: 6150


> New S[]: 
	
	 0  0  0  1  0  0  1  1  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 26
> Selected Move:	6460	3	0	8	18700


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  2  0    >new incumb.: 6460


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 27
> Selected Move:	6460	4	8	6	19400


> New Y[]: 
	
	 0  3  4  1  0  0  2  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 22
> Selected Move:	6460	4	6	7	18700


> New Y[]: 
	
	 0  3  4  1  0  0  1  2  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 25
> Selected Move:	6460	3	6	9	19200


> New Y[]: 
	
	 0  3  4  1  0  0  0  2  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 24
> Selected Move:	6460	4	7	8	19200


> New Y[]: 
	
	 0  3  4  1  0  0  0  1  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 23
> Selected Move:	6460	4	8	9	18600


> New Y[]: 
	
	 0  3  4  1  0  0  0  1  1  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 27
> Selected Move:	6150	3	9	0	17000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  1  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 24
> Selected Move:	6460	3	1	9	18500


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 26
> Selected Move:	6580	3	7	5	18000


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  1  3    >new incumb.: 6580


> New S[]: 
	
	 0  0  0  1  0  1  0  0  1  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 28
> Selected Move:	6580	4	9	5	19800


> New Y[]: 
	
	 2  0  4  1  0  3  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  1  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 21
> Selected Move:	6580	4	5	8	18100


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  1  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 27
> Selected Move:	6460	3	5	7	18600


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 24
> Selected Move:	6460	4	8	7	19100


> New Y[]: 
	
	 2  0  4  1  0  0  0  3  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 26
> Selected Move:	6440	3	9	6	18600


> New Y[]: 
	
	 2  0  4  1  0  0  1  3  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  1  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 25
> Selected Move:	6440	4	7	6	19100


> New Y[]: 
	
	 2  0  4  1  0  0  3  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  1  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 24
> Selected Move:	6440	4	6	8	18100


> New Y[]: 
	
	 2  0  4  1  0  0  1  1  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  1  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 26
> Selected Move:	6440	3	7	5	17600


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  1  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 27
> Selected Move:	6440	4	8	5	19300


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  1  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 24
> Selected Move:	6440	4	5	6	18600


> New Y[]: 
	
	 2  0  4  1  0  1  3  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  1  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 25
> Selected Move:	6380	3	8	7	18100


> New Y[]: 
	
	 2  0  4  1  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 27
> Selected Move:	6380	4	6	3	19800


> New Y[]: 
	
	 2  0  4  3  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 24
> Selected Move:	6380	4	3	5	18800


> New Y[]: 
	
	 2  0  4  1  0  3  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 24
> Selected Move:	6380	4	5	7	17600


> New Y[]: 
	
	 2  0  4  1  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 25
> Selected Move:	6380	3	2	9	19800


> New Y[]: 
	
	 2  0  0  1  0  1  1  3  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 26
> Selected Move:	6380	4	7	9	19200


> New Y[]: 
	
	 2  0  0  1  0  1  1  4  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 26
> Selected Move:	6380	4	7	5	19800


> New Y[]: 
	
	 2  0  0  1  0  4  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 25
> Selected Move:	6380	4	5	6	19800


> New Y[]: 
	
	 2  0  0  1  0  1  4  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 26
> Selected Move:	6380	3	6	2	17500


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  0  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 26
> Selected Move:	6380	4	9	5	19300


> New Y[]: 
	
	 2  0  4  1  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 24
> Selected Move:	6380	4	5	7	18100


> New Y[]: 
	
	 2  0  4  1  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 25
> Selected Move:	6271	4	7	3	20300


> New Y[]: 
	
	 2  0  4  3  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 27
> Selected Move:	6292	3	7	8	20800


> New Y[]: 
	
	 2  0  4  3  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  1  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 27
> Selected Move:	6334	3	9	6	20300


> New Y[]: 
	
	 2  0  4  3  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  1  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 26
> Selected Move:	6180	3	3	7	19600


> New Y[]: 
	
	 2  0  4  0  0  1  1  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 21
> Selected Move:	6306	1	-1	3	24100


> New Y[]: 
	
	 2  0  4  1  0  1  1  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 26
> Selected Move:	6496	4	7	8	23600


> New Y[]: 
	
	 2  0  4  1  0  1  1  1  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 39 #######################


> Neighbours evaluated; 30
> Selected Move:	6448	3	6	4	23600


> New Y[]: 
	
	 2  0  4  1  1  1  0  1  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  1  0 
 > pw :0,35

## ITERATION 40 #######################


> Neighbours evaluated; 27
> Selected Move:	6285	3	4	9	24100


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,355

## ITERATION 41 #######################


> Neighbours evaluated; 26
> Selected Move:	6300	4	8	9	24000


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,36

## ITERATION 42 #######################


> Neighbours evaluated; 28
> Selected Move:	6180	4	0	7	19700


> New Y[]: 
	
	 0  0  4  1  0  1  0  2  1  3 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,365

## ITERATION 43 #######################


> Neighbours evaluated; 27
> Selected Move:	6180	4	7	8	19700


> New Y[]: 
	
	 0  0  4  1  0  1  0  1  2  3 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,37

## ITERATION 44 #######################


> Neighbours evaluated; 26
> Selected Move:	6180	4	8	9	19200


> New Y[]: 
	
	 0  0  4  1  0  1  0  1  3  2 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,375

## ITERATION 45 #######################


> Neighbours evaluated; 26
> Selected Move:	6180	4	8	7	19700


> New Y[]: 
	
	 0  0  4  1  0  1  0  3  1  2 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,38

## ITERATION 46 #######################


> Neighbours evaluated; 25
> Selected Move:	6180	3	9	0	18100


> New Y[]: 
	
	 2  0  4  1  0  1  0  3  1  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 47 #######################


> Neighbours evaluated; 21
> Selected Move:	6180	4	7	5	19300


> New Y[]: 
	
	 2  0  4  1  0  3  0  1  1  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 48 #######################


> Neighbours evaluated; 21
> Selected Move:	6180	4	5	8	17600


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  3  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 49 #######################


> Neighbours evaluated; 18
> Selected Move:	6180	3	0	6	20000


> New Y[]: 
	
	 0  0  4  1  0  1  2  1  3  0 


> New S[]: 
	
	 0  0  1  1  0  0  1  0  0  0 
 > pw :0,37

## ITERATION 50 #######################


> Neighbours evaluated; 26
> Selected Move:	6180	4	6	5	19700


> New Y[]: 
	
	 0  0  4  1  0  2  1  1  3  0 


> New S[]: 
	
	 0  0  1  1  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 51 #######################


> Neighbours evaluated; 26
> Selected Move:	6180	4	5	7	19300


> New Y[]: 
	
	 0  0  4  1  0  1  1  2  3  0 


> New S[]: 
	
	 0  0  1  1  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 52 #######################


> Neighbours evaluated; 25
> Selected Move:	6180	4	7	8	19800


> New Y[]: 
	
	 0  0  4  1  0  1  1  3  2  0 


> New S[]: 
	
	 0  0  1  1  0  0  1  0  0  0 
 > pw :0,355

## ITERATION 53 #######################


> Neighbours evaluated; 25
> Selected Move:	6109	4	8	5	20200


> New Y[]: 
	
	 0  0  4  1  0  2  1  3  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 54 #######################


> Neighbours evaluated; 27
> Selected Move:	6005	4	5	6	20500


> New Y[]: 
	
	 0  0  4  1  0  1  2  3  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 55 #######################


> Neighbours evaluated; 22
> Selected Move:	6077	4	6	7	20300


> New Y[]: 
	
	 0  0  4  1  0  1  3  2  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 56 #######################


> Neighbours evaluated; 23
> Selected Move:	6078	4	7	8	20300


> New Y[]: 
	
	 0  0  4  1  0  1  3  1  2  0 


> New S[]: 
	
	 0  0  1  1  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 57 #######################


> Neighbours evaluated; 25
> Selected Move:	5946	4	8	5	20700


> New Y[]: 
	
	 0  0  4  1  0  2  3  1  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 58 #######################


> Neighbours evaluated; 23
> Selected Move:	6146	3	6	9	20100


> New Y[]: 
	
	 0  0  4  1  0  2  0  1  1  3 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,345

## ITERATION 59 #######################


> Neighbours evaluated; 24
> Selected Move:	6111	4	9	8	20200


> New Y[]: 
	
	 0  0  4  1  0  2  0  1  3  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,35

## ITERATION 60 #######################


> Neighbours evaluated; 23
> Selected Move:	6180	4	5	7	19800


> New Y[]: 
	
	 0  0  4  1  0  1  0  2  3  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,355

## ITERATION 61 #######################


> Neighbours evaluated; 23
> Selected Move:	6100	3	8	1	18200


> New Y[]: 
	
	 0  3  4  1  0  1  0  2  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,36

## ITERATION 62 #######################


> Neighbours evaluated; 27
> Selected Move:	6100	4	7	3	19700


> New Y[]: 
	
	 0  3  4  2  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,365

## ITERATION 63 #######################


> Neighbours evaluated; 28
> Selected Move:	6205	3	5	8	20700


> New Y[]: 
	
	 0  3  4  2  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,37

## ITERATION 64 #######################


> Neighbours evaluated; 24
> Selected Move:	6386	3	9	6	20200


> New Y[]: 
	
	 0  3  4  2  0  0  1  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,375

## ITERATION 65 #######################


> Neighbours evaluated; 26
> Selected Move:	6150	3	3	0	18500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  1  1  0 
 > pw :0,38

## ITERATION 66 #######################


> Neighbours evaluated; 17
> Selected Move:	6272	3	2	3	20100


> New Y[]: 
	
	 2  3  0  4  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  1  0  0 
 > pw :0,385

## ITERATION 67 #######################


> Neighbours evaluated; 25
> Selected Move:	6422	3	8	9	20100


> New Y[]: 
	
	 2  3  0  4  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,39

## ITERATION 68 #######################


> Neighbours evaluated; 22
> Selected Move:	6460	4	3	6	19300


> New Y[]: 
	
	 2  3  0  1  0  0  4  1  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,395

## ITERATION 69 #######################


> Neighbours evaluated; 25
> Selected Move:	6460	4	6	7	18700


> New Y[]: 
	
	 2  3  0  1  0  0  1  4  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,39

## ITERATION 70 #######################


> Neighbours evaluated; 26
> Selected Move:	6460	4	7	9	18700


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  4 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,385

## ITERATION 71 #######################


> Neighbours evaluated; 26
> Selected Move:	6310	3	6	8	19200


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  4 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,38

## ITERATION 72 #######################


> Neighbours evaluated; 27
> Selected Move:	6310	4	9	7	19200


> New Y[]: 
	
	 2  3  0  1  0  0  0  4  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,375

## ITERATION 73 #######################


> Neighbours evaluated; 26
> Selected Move:	6310	4	7	8	18600


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,37

## ITERATION 74 #######################


> Neighbours evaluated; 27
> Selected Move:	6310	3	9	6	18100


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  4  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  1  0  0 
 > pw :0,365

## ITERATION 75 #######################


> Neighbours evaluated; 25
> Selected Move:	6364	1	-1	4	24100


> New Y[]: 
	
	 2  3  0  1  1  0  1  1  4  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  1  0  0 
 > pw :0,36

## ITERATION 76 #######################


> Neighbours evaluated; 29
> Selected Move:	6290	2	3	-1	19600


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  1  1  0 
 > pw :0,355

## ITERATION 77 #######################


> Neighbours evaluated; 19
> Selected Move:	6290	3	7	3	18100


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  4  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  1  0 
 > pw :0,35

## ITERATION 78 #######################


> Neighbours evaluated; 26
> Selected Move:	6290	4	8	4	19000


> New Y[]: 
	
	 2  3  0  1  4  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  1  0 
 > pw :0,345

## ITERATION 79 #######################


> Neighbours evaluated; 27
> Selected Move:	6310	3	4	7	18700


> New Y[]: 
	
	 2  3  0  1  0  0  1  4  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  1  0  0 
 > pw :0,34

## ITERATION 80 #######################


> Neighbours evaluated; 23
> Selected Move:	6310	4	7	6	19300


> New Y[]: 
	
	 2  3  0  1  0  0  4  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  1  0  0 
 > pw :0,335

## ITERATION 81 #######################


> Neighbours evaluated; 24
> Selected Move:	6290	3	7	4	19300


> New Y[]: 
	
	 2  3  0  1  1  0  4  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  1  0 
 > pw :0,33

## ITERATION 82 #######################


> Neighbours evaluated; 25
> Selected Move:	6257	4	6	3	20100


> New Y[]: 
	
	 2  3  0  4  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  1  0 
 > pw :0,325

## ITERATION 83 #######################


> Neighbours evaluated; 26
> Selected Move:	6225	3	3	7	20200


> New Y[]: 
	
	 2  3  0  0  1  0  1  4  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  1  1  0 
 > pw :0,32

## ITERATION 84 #######################


> Neighbours evaluated; 19
> Selected Move:	6356	1	-1	3	24700


> New Y[]: 
	
	 2  3  0  1  1  0  1  4  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  1  0  0 
 > pw :0,315

## ITERATION 85 #######################


> Neighbours evaluated; 28
> Selected Move:	6285	4	7	4	25000


> New Y[]: 
	
	 2  3  0  1  4  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  1  0  0 
 > pw :0,31

## ITERATION 86 #######################


> Neighbours evaluated; 26
> Selected Move:	6460	3	4	2	23000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  1  0 
 > pw :0,315

## ITERATION 87 #######################


> Neighbours evaluated; 18
> Selected Move:	6568	3	6	9	23500


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  1  0 
 > pw :0,32

## ITERATION 88 #######################


> Neighbours evaluated; 20
> Selected Move:	6220	3	8	6	23000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  1  0  0 
 > pw :0,325

## ITERATION 89 #######################


> Neighbours evaluated; 26
> Selected Move:	6330	3	9	5	22000


> New Y[]: 
	
	 2  3  4  1  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  1  0  0 
 > pw :0,33

## ITERATION 90 #######################


> Neighbours evaluated; 27
> Selected Move:	6240	3	6	4	22000


> New Y[]: 
	
	 2  3  4  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,335

## ITERATION 91 #######################


> Neighbours evaluated; 30
> Selected Move:	6230	3	7	6	22000


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 92 #######################


> Neighbours evaluated; 36
> Selected Move:	6130	3	4	9	22500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  1 
 > pw :0,345

## ITERATION 93 #######################


> Neighbours evaluated; 33
> Selected Move:	6118	3	6	7	22500


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,35

## ITERATION 94 #######################


> Neighbours evaluated; 20
> Selected Move:	6150	2	5	-1	17000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,355

## ITERATION 95 #######################


> Neighbours evaluated; 18
> Selected Move:	6200	3	2	4	19000


> New Y[]: 
	
	 2  3  0  1  4  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,36

## ITERATION 96 #######################


> Neighbours evaluated; 27
> Selected Move:	6200	4	4	7	18700


> New Y[]: 
	
	 2  3  0  1  1  0  0  4  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,365

## ITERATION 97 #######################


> Neighbours evaluated; 27
> Selected Move:	6200	4	7	9	18700


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,37

## ITERATION 98 #######################


> Neighbours evaluated; 26
> Selected Move:	6200	3	9	6	18800


> New Y[]: 
	
	 2  3  0  1  1  0  4  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,375

## ITERATION 99 #######################


> Neighbours evaluated; 25
> Selected Move:	6200	4	6	3	19600


> New Y[]: 
	
	 2  3  0  4  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,37

## ITERATION 100 #######################


> Neighbours evaluated; 24
> Selected Move:	6200	4	3	4	18500


> New Y[]: 
	
	 2  3  0  1  4  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 101 #######################


> Neighbours evaluated; 22
> Selected Move:	6200	4	4	7	18200


> New Y[]: 
	
	 2  3  0  1  1  0  1  4  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 102 #######################


> Neighbours evaluated; 22
> Selected Move:	6200	3	1	8	19800


> New Y[]: 
	
	 2  0  0  1  1  0  1  4  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,355

## ITERATION 103 #######################


> Neighbours evaluated; 27
> Selected Move:	6200	4	7	8	19700


> New Y[]: 
	
	 2  0  0  1  1  0  1  3  4  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,35

## ITERATION 104 #######################


> Neighbours evaluated; 25
> Selected Move:	6200	4	7	4	19900


> New Y[]: 
	
	 2  0  0  1  3  0  1  1  4  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,345

## ITERATION 105 #######################


> Neighbours evaluated; 26
> Selected Move:	6166	4	4	8	20100


> New Y[]: 
	
	 2  0  0  1  4  0  1  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,34

## ITERATION 106 #######################


> Neighbours evaluated; 23
> Selected Move:	6180	3	4	5	19900


> New Y[]: 
	
	 2  0  0  1  0  4  1  1  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 107 #######################


> Neighbours evaluated; 25
> Selected Move:	6180	4	5	6	19900


> New Y[]: 
	
	 2  0  0  1  0  1  4  1  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 108 #######################


> Neighbours evaluated; 25
> Selected Move:	6180	4	6	7	19300


> New Y[]: 
	
	 2  0  0  1  0  1  1  4  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 109 #######################


> Neighbours evaluated; 23
> Selected Move:	6200	3	8	4	19500


> New Y[]: 
	
	 2  0  0  1  3  1  1  4  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  1  0  0  0 
 > pw :0,32

## ITERATION 110 #######################


> Neighbours evaluated; 24
> Selected Move:	6200	4	4	6	19800


> New Y[]: 
	
	 2  0  0  1  1  1  3  4  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  1  0  0  0 
 > pw :0,315

## ITERATION 111 #######################


> Neighbours evaluated; 25
> Selected Move:	6286	3	4	9	20300


> New Y[]: 
	
	 2  0  0  1  0  1  3  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,31

## ITERATION 112 #######################


> Neighbours evaluated; 26
> Selected Move:	6287	4	7	9	20300


> New Y[]: 
	
	 2  0  0  1  0  1  3  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,305

## ITERATION 113 #######################


> Neighbours evaluated; 23
> Selected Move:	6200	3	6	4	20000


> New Y[]: 
	
	 2  0  0  1  3  1  0  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,3

## ITERATION 114 #######################


> Neighbours evaluated; 27
> Selected Move:	6200	4	4	7	19800


> New Y[]: 
	
	 2  0  0  1  1  1  0  3  0  4 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,295

## ITERATION 115 #######################


> Neighbours evaluated; 26
> Selected Move:	6200	4	7	9	19200


> New Y[]: 
	
	 2  0  0  1  1  1  0  4  0  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,29

## ITERATION 116 #######################


> Neighbours evaluated; 24
> Selected Move:	6292	1	-1	6	25200


> New Y[]: 
	
	 2  0  0  1  1  1  1  4  0  3 


> New S[]: 
	
	 0  0  0  1  0  1  0  1  0  0 
 > pw :0,285

## ITERATION 117 #######################


> Neighbours evaluated; 27
> Selected Move:	6233	4	7	4	25500


> New Y[]: 
	
	 2  0  0  1  4  1  1  1  0  3 


> New S[]: 
	
	 0  0  0  1  0  1  0  1  0  0 
 > pw :0,28

## ITERATION 118 #######################


> Neighbours evaluated; 28
> Selected Move:	6292	3	4	8	25100


> New Y[]: 
	
	 2  0  0  1  0  1  1  1  4  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,285

## ITERATION 119 #######################


> Neighbours evaluated; 28
> Selected Move:	6267	3	6	4	25100


> New Y[]: 
	
	 2  0  0  1  1  1  0  1  4  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,29

## ITERATION 120 #######################


> Neighbours evaluated; 28
> Selected Move:	6185	3	8	2	23500


> New Y[]: 
	
	 2  0  4  1  1  1  0  1  0  3 


> New S[]: 
	
	 0  0  0  1  0  1  0  1  0  0 
 > pw :0,295

## ITERATION 121 #######################


> Neighbours evaluated; 25
> Selected Move:	6200	4	2	4	19500


> New Y[]: 
	
	 2  0  0  1  4  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,3

## ITERATION 122 #######################


> Neighbours evaluated; 22
> Selected Move:	6200	4	4	5	19800


> New Y[]: 
	
	 2  0  0  1  1  4  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,305

## ITERATION 123 #######################


> Neighbours evaluated; 25
> Selected Move:	6089	3	4	8	20300


> New Y[]: 
	
	 2  0  0  1  0  4  0  1  1  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,31

## ITERATION 124 #######################


> Neighbours evaluated; 25
> Selected Move:	6180	4	5	7	19700


> New Y[]: 
	
	 2  0  0  1  0  1  0  4  1  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,315

## ITERATION 125 #######################


> Neighbours evaluated; 24
> Selected Move:	6180	4	7	8	19100


> New Y[]: 
	
	 2  0  0  1  0  1  0  1  4  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 126 #######################


> Neighbours evaluated; 21
> Selected Move:	6180	4	8	9	19800


> New Y[]: 
	
	 2  0  0  1  0  1  0  1  3  4 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 127 #######################


> Neighbours evaluated; 22
> Selected Move:	6180	4	9	7	19800


> New Y[]: 
	
	 2  0  0  1  0  1  0  4  3  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 128 #######################


> Neighbours evaluated; 23
> Selected Move:	6200	3	8	4	20000


> New Y[]: 
	
	 2  0  0  1  3  1  0  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,315

## ITERATION 129 #######################


> Neighbours evaluated; 23
> Selected Move:	6169	4	4	7	20100


> New Y[]: 
	
	 2  0  0  1  4  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,31

## ITERATION 130 #######################


> Neighbours evaluated; 23
> Selected Move:	6256	3	4	6	20400


> New Y[]: 
	
	 2  0  0  1  0  1  4  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,305

## ITERATION 131 #######################


> Neighbours evaluated; 22
> Selected Move:	6258	4	6	5	20400


> New Y[]: 
	
	 2  0  0  1  0  4  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,3

## ITERATION 132 #######################


> Neighbours evaluated; 25
> Selected Move:	6200	3	9	4	19900


> New Y[]: 
	
	 2  0  0  1  1  4  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  1  0  0  0 
 > pw :0,295

## ITERATION 133 #######################


> Neighbours evaluated; 24
> Selected Move:	6200	4	5	4	19600


> New Y[]: 
	
	 2  0  0  1  4  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  1  0  0  0 
 > pw :0,29

## ITERATION 134 #######################


> Neighbours evaluated; 20
> Selected Move:	6200	4	4	6	19900


> New Y[]: 
	
	 2  0  0  1  1  1  4  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  1  0  0  0 
 > pw :0,285

## ITERATION 135 #######################


> Neighbours evaluated; 20
> Selected Move:	6172	4	7	4	20100


> New Y[]: 
	
	 2  0  0  1  3  1  4  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  1  0  0  0 
 > pw :0,28

## ITERATION 136 #######################


> Neighbours evaluated; 21
> Selected Move:	6172	4	4	6	20100


> New Y[]: 
	
	 2  0  0  1  4  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  1  0  0  0 
 > pw :0,285

## ITERATION 137 #######################


> Neighbours evaluated; 19
> Selected Move:	6180	3	4	8	19700


> New Y[]: 
	
	 2  0  0  1  0  1  3  1  4  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 138 #######################


> Neighbours evaluated; 22
> Selected Move:	6180	4	6	7	19200


> New Y[]: 
	
	 2  0  0  1  0  1  1  3  4  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 139 #######################


> Neighbours evaluated; 21
> Selected Move:	6186	1	-1	4	25200


> New Y[]: 
	
	 2  0  0  1  1  1  1  3  4  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,3

## ITERATION 140 #######################


> Neighbours evaluated; 27
> Selected Move:	6160	3	8	2	23600


> New Y[]: 
	
	 2  0  4  1  1  1  1  3  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  1  0  0 
 > pw :0,305

## ITERATION 141 #######################


> Neighbours evaluated; 24
> Selected Move:	6440	3	6	8	24100


> New Y[]: 
	
	 2  0  4  1  1  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  1  0 
 > pw :0,31

## ITERATION 142 #######################


> Neighbours evaluated; 25
> Selected Move:	6357	4	7	4	24300


> New Y[]: 
	
	 2  0  4  1  3  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  1  0 
 > pw :0,315

## ITERATION 143 #######################


> Neighbours evaluated; 27
> Selected Move:	6271	3	4	6	24600


> New Y[]: 
	
	 2  0  4  1  0  1  3  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 144 #######################


> Neighbours evaluated; 21
> Selected Move:	6148	2	3	-1	20100


> New Y[]: 
	
	 2  0  4  0  0  1  3  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 145 #######################


> Neighbours evaluated; 17
> Selected Move:	6180	4	6	8	19100


> New Y[]: 
	
	 2  0  4  0  0  1  1  1  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 146 #######################


> Neighbours evaluated; 19
> Selected Move:	6180	3	6	9	19600


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,335

## ITERATION 147 #######################


> Neighbours evaluated; 19
> Selected Move:	6180	4	8	9	19500


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,34

## ITERATION 148 #######################


> Neighbours evaluated; 20
> Selected Move:	6146	4	9	7	20100


> New Y[]: 
	
	 2  0  4  0  0  1  0  3  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,345

## ITERATION 149 #######################


> Neighbours evaluated; 22
> Selected Move:	6133	1	-1	3	24600


> New Y[]: 
	
	 2  0  4  1  0  1  0  3  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,35

## ITERATION 150 #######################


> Neighbours evaluated; 21
> Selected Move:	6180	4	2	8	19700


> New Y[]: 
	
	 2  0  0  1  0  1  0  3  4  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,355

## ITERATION 151 #######################


> Neighbours evaluated; 21
> Selected Move:	6074	4	8	9	20300


> New Y[]: 
	
	 2  0  0  1  0  1  0  3  1  4 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,36

## ITERATION 152 #######################


> Neighbours evaluated; 21
> Selected Move:	6036	3	9	6	20400


> New Y[]: 
	
	 2  0  0  1  0  1  4  3  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 153 #######################


> Neighbours evaluated; 22
> Selected Move:	6071	4	6	7	20300


> New Y[]: 
	
	 2  0  0  1  0  1  3  4  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,37

## ITERATION 154 #######################


> Neighbours evaluated; 20
> Selected Move:	5904	3	5	4	20800


> New Y[]: 
	
	 2  0  0  1  1  0  3  4  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,375

## ITERATION 155 #######################


> Neighbours evaluated; 25
> Selected Move:	6200	3	6	1	18700


> New Y[]: 
	
	 2  3  0  1  1  0  0  4  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,38

## ITERATION 156 #######################


> Neighbours evaluated; 22
> Selected Move:	6200	4	7	4	19000


> New Y[]: 
	
	 2  3  0  1  4  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,385

## ITERATION 157 #######################


> Neighbours evaluated; 22
> Selected Move:	6200	4	4	8	18100


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  4  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,39

## ITERATION 158 #######################


> Neighbours evaluated; 22
> Selected Move:	6161	4	8	3	20100


> New Y[]: 
	
	 2  3  0  4  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,395

## ITERATION 159 #######################


> Neighbours evaluated; 23
> Selected Move:	6161	3	8	9	20100


> New Y[]: 
	
	 2  3  0  4  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,4

## ITERATION 160 #######################


> Neighbours evaluated; 24
> Selected Move:	6070	3	4	8	20600


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,405

## ITERATION 161 #######################


> Neighbours evaluated; 21
> Selected Move:	6150	3	3	2	19000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  1 
 > pw :0,41

## ITERATION 162 #######################


> Neighbours evaluated; 18
> Selected Move:	6150	3	7	3	17500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  1 
 > pw :0,415

## ITERATION 163 #######################


> Neighbours evaluated; 30
> Selected Move:	6150	3	9	6	17000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  1  0 
 > pw :0,41

## ITERATION 164 #######################


> Neighbours evaluated; 28
> Selected Move:	6050	3	2	9	19200


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  4 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 165 #######################


> Neighbours evaluated; 24
> Selected Move:	6050	4	9	6	19800


> New Y[]: 
	
	 2  3  0  1  0  0  4  0  1  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 166 #######################


> Neighbours evaluated; 22
> Selected Move:	6050	4	6	8	18600


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  4  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 167 #######################


> Neighbours evaluated; 25
> Selected Move:	6011	3	3	7	20100


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  4  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,39

## ITERATION 168 #######################


> Neighbours evaluated; 20
> Selected Move:	5916	1	-1	3	24600


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  1  0 
 > pw :0,385

## ITERATION 169 #######################


> Neighbours evaluated; 22
> Selected Move:	6089	3	6	4	24600


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,38

## ITERATION 170 #######################


> Neighbours evaluated; 27
> Selected Move:	5884	4	8	7	25200


> New Y[]: 
	
	 2  3  0  1  1  0  0  4  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,375

## ITERATION 171 #######################


> Neighbours evaluated; 25
> Selected Move:	5910	4	7	9	25200


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  1  4 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,38

## ITERATION 172 #######################


> Neighbours evaluated; 27
> Selected Move:	5846	3	9	6	25300


> New Y[]: 
	
	 2  3  0  1  1  0  4  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  1  0  0 
 > pw :0,385

## ITERATION 173 #######################


> Neighbours evaluated; 18
> Selected Move:	6046	4	1	8	20400


> New Y[]: 
	
	 2  0  0  1  1  0  4  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,39

## ITERATION 174 #######################


> Neighbours evaluated; 23
> Selected Move:	6122	4	6	8	20200


> New Y[]: 
	
	 2  0  0  1  1  0  3  1  4  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,395

## ITERATION 175 #######################


> Neighbours evaluated; 21
> Selected Move:	6042	3	8	5	20400


> New Y[]: 
	
	 2  0  0  1  1  4  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  1  0  0  0 
 > pw :0,4

## ITERATION 176 #######################


> Neighbours evaluated; 19
> Selected Move:	6160	4	6	4	20100


> New Y[]: 
	
	 2  0  0  1  3  4  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  1  0  0  0 
 > pw :0,405

## ITERATION 177 #######################


> Neighbours evaluated; 19
> Selected Move:	5957	3	6	9	20600


> New Y[]: 
	
	 2  0  0  1  3  4  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,41

## ITERATION 178 #######################


> Neighbours evaluated; 21
> Selected Move:	6036	4	4	7	20400


> New Y[]: 
	
	 2  0  0  1  1  4  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,415

## ITERATION 179 #######################


> Neighbours evaluated; 22
> Selected Move:	5807	3	4	8	20900


> New Y[]: 
	
	 2  0  0  1  0  4  0  3  1  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,42

## ITERATION 180 #######################


> Neighbours evaluated; 20
> Selected Move:	6012	4	7	8	20400


> New Y[]: 
	
	 2  0  0  1  0  4  0  1  3  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,425

## ITERATION 181 #######################


> Neighbours evaluated; 21
> Selected Move:	5998	3	8	6	20900


> New Y[]: 
	
	 2  0  0  1  0  4  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  1 
 > pw :0,43

## ITERATION 182 #######################


> Neighbours evaluated; 21
> Selected Move:	5793	3	9	8	20900


> New Y[]: 
	
	 2  0  0  1  0  4  3  1  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,435

## ITERATION 183 #######################


> Neighbours evaluated; 18
> Selected Move:	6006	4	6	7	20400


> New Y[]: 
	
	 2  0  0  1  0  4  1  3  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,44

## ITERATION 184 #######################


> Neighbours evaluated; 20
> Selected Move:	5936	3	5	4	20600


> New Y[]: 
	
	 2  0  0  1  4  0  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,445

## ITERATION 185 #######################


> Neighbours evaluated; 21
> Selected Move:	5978	4	4	7	20500


> New Y[]: 
	
	 2  0  0  1  3  0  1  4  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  1  0 
 > pw :0,45

## ITERATION 186 #######################


> Neighbours evaluated; 21
> Selected Move:	5960	3	4	9	20200


> New Y[]: 
	
	 2  0  0  1  0  0  1  4  1  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,455

## ITERATION 187 #######################


> Neighbours evaluated; 24
> Selected Move:	6050	4	7	8	19600


> New Y[]: 
	
	 2  0  0  1  0  0  1  1  4  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,46

## ITERATION 188 #######################


> Neighbours evaluated; 22
> Selected Move:	6050	3	7	5	19100


> New Y[]: 
	
	 2  0  0  1  0  1  1  0  4  3 


> New S[]: 
	
	 1  0  0  1  0  1  0  0  0  0 
 > pw :0,465

## ITERATION 189 #######################


> Neighbours evaluated; 23
> Selected Move:	6050	4	8	9	19800


> New Y[]: 
	
	 2  0  0  1  0  1  1  0  3  4 


> New S[]: 
	
	 1  0  0  1  0  1  0  0  0  0 
 > pw :0,47

## ITERATION 190 #######################


> Neighbours evaluated; 22
> Selected Move:	5909	3	5	7	20300


> New Y[]: 
	
	 2  0  0  1  0  0  1  1  3  4 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,475

## ITERATION 191 #######################


> Neighbours evaluated; 20
> Selected Move:	5908	4	9	7	20300


> New Y[]: 
	
	 2  0  0  1  0  0  1  4  3  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,48

## ITERATION 192 #######################


> Neighbours evaluated; 22
> Selected Move:	5954	4	7	8	20200


> New Y[]: 
	
	 2  0  0  1  0  0  1  3  4  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,485

## ITERATION 193 #######################


> Neighbours evaluated; 21
> Selected Move:	5710	4	7	6	20700


> New Y[]: 
	
	 2  0  0  1  0  0  3  1  4  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,49

## ITERATION 194 #######################


> Neighbours evaluated; 22
> Selected Move:	5952	3	7	5	20200


> New Y[]: 
	
	 2  0  0  1  0  1  3  0  4  1 


> New S[]: 
	
	 1  0  0  1  0  1  0  0  0  0 
 > pw :0,495

## ITERATION 195 #######################


> Neighbours evaluated; 22
> Selected Move:	5880	3	9	4	19700


> New Y[]: 
	
	 2  0  0  1  1  1  3  0  4  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 196 #######################


> Neighbours evaluated; 23
> Selected Move:	5880	4	6	4	19400


> New Y[]: 
	
	 2  0  0  1  3  1  1  0  4  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,505

## ITERATION 197 #######################


> Neighbours evaluated; 23
> Selected Move:	5880	4	4	8	19600


> New Y[]: 
	
	 2  0  0  1  4  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,51

## ITERATION 198 #######################


> Neighbours evaluated; 20
> Selected Move:	5880	4	4	5	19900


> New Y[]: 
	
	 2  0  0  1  1  4  1  0  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,515

## ITERATION 199 #######################


> Neighbours evaluated; 21
> Selected Move:	5880	4	5	6	19900


> New Y[]: 
	
	 2  0  0  1  1  1  4  0  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  1  0  0  0 
 > pw :0,52

## ITERATION 200 #######################


> Neighbours evaluated; 19
> Selected Move:	5880	3	6	7	19300


> New Y[]: 
	
	 2  0  0  1  1  1  0  4  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,515

## ITERATION 201 #######################


> Neighbours evaluated; 22
> Selected Move:	5880	4	7	4	19600


> New Y[]: 
	
	 2  0  0  1  4  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,51

## ITERATION 202 #######################


> Neighbours evaluated; 19
> Selected Move:	5880	4	4	5	19900


> New Y[]: 
	
	 2  0  0  1  1  4  0  1  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,505

## ITERATION 203 #######################


> Neighbours evaluated; 19
> Selected Move:	5860	3	5	2	18100


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  1  0 
 > pw :0,5

## ITERATION 204 #######################


> Neighbours evaluated; 22
> Selected Move:	5880	3	0	5	19700


> New Y[]: 
	
	 0  0  4  1  1  2  0  1  3  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  1  0  0 
 > pw :0,495

## ITERATION 205 #######################


> Neighbours evaluated; 26
> Selected Move:	5880	4	5	7	19300


> New Y[]: 
	
	 0  0  4  1  1  1  0  2  3  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  1  0  0 
 > pw :0,49

## ITERATION 206 #######################


> Neighbours evaluated; 26
> Selected Move:	5880	4	7	8	19800


> New Y[]: 
	
	 0  0  4  1  1  1  0  3  2  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  1  0  0 
 > pw :0,485

## ITERATION 207 #######################


> Neighbours evaluated; 26
> Selected Move:	6034	3	4	9	20300


> New Y[]: 
	
	 0  0  4  1  0  1  0  3  2  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,48

## ITERATION 208 #######################


> Neighbours evaluated; 24
> Selected Move:	5844	4	8	5	20700


> New Y[]: 
	
	 0  0  4  1  0  2  0  3  1  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,475

## ITERATION 209 #######################


> Neighbours evaluated; 25
> Selected Move:	5785	3	9	4	20200


> New Y[]: 
	
	 0  0  4  1  1  2  0  3  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  1  0  0 
 > pw :0,47

## ITERATION 210 #######################


> Neighbours evaluated; 26
> Selected Move:	5860	3	5	0	18600


> New Y[]: 
	
	 2  0  4  1  1  0  0  3  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  1  0 
 > pw :0,465

## ITERATION 211 #######################


> Neighbours evaluated; 21
> Selected Move:	5860	4	7	4	18800


> New Y[]: 
	
	 2  0  4  1  3  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  1  0 
 > pw :0,46
________________________________________________________________

Best solution found: 6580
Run Termination time: 31.01.2010 10:40:54
Run duration: 00:02:47.4375000
________________________________________________________________
